منابع مشابه
k-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کاملConstrained Delaunay Triangulation Using Delaunay Visibility
An algorithm for constructing constrained Delaunay triangulation (CDT) of a planar straight-line graph (PSLG) is presented. Although the uniform grid method can reduce the time cost of visibility determinations, the time needed to construct the CDT is still long. The algorithm proposed in this paper decreases the number of edges involved in the computation of visibility by replacing traditional...
متن کاملOn Voronoi-Delaunay Duality and Delaunay Meshes
In this paper, we are concerned with Delaunay triangulations of the vertex set of a piecewise flat (pwf) surface. We first propose the notion of well-formed Voronoi diagrams and establish a precise dual relationship between them and proper Delaunay triangulations on pwf surfaces. Then we provide an algorithm which, given any input manifold triangle mesh, constructs aDelaunay mesh: a manifold tr...
متن کاملDelaunay Supertopes
A perfect inhomogeneous quadratic form is defined by that it can be reconstructed in a unique way from its arithmetic minimum and all integral vectors on which it is attained. Such a form defines an integral Delaunay polytope that has a remarkable property of having a unique circumscribed ellipsoid whose interior is free of integral points. A polytope with this uniqueness property is called a p...
متن کاملMonotone partitions and almost partitions
Article history: Received 28 April 2014 Received in revised form 14 October 2014 Accepted 14 October 2014 Available online 31 October 2014 MSC: 54D20
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology
سال: 1997
ISSN: 0040-9383
DOI: 10.1016/0040-9383(96)00002-x